On the Bruhat Order of the Symmetric Group and Its Shellability
نویسنده
چکیده
In this paper we discuss the Bruhat order of the symmetric group. We give two criteria for comparing elements in this poset and show that the poset is Eulerian. We also discuss the notion of shellability and EL-shellability, and use this concept to show that the order complex associated to the Bruhat order triangulates a sphere.
منابع مشابه
Lexicographic shellability of partial involutions
In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographically shellable poset. We determine which subintervals of the Bruhat posets are Eulerian, and moreover, by studying certain embeddings of the symmetric groups and their involutions into rook matrices and partial involu...
متن کاملThe Bruhat order on conjugation-invariant sets of involutions in the symmetric group
Let In be the set of involutions in the symmetric group Sn, and for A ⊆ {0, 1, . . . , n}, let F n = {σ ∈ In | σ has a fixed points for some a ∈ A}. We give a complete characterisation of the sets A for which F n , with the order induced by the Bruhat order on Sn, is a graded poset. In particular, we prove that F {1} n (i.e., the set of involutions with exactly one fixed point) is graded, which...
متن کاملShellability in Reductive Monoids
The purpose of this paper is to extend to monoids the work of Björner, Wachs and Proctor on the shellability of the Bruhat-Chevalley order on Weyl groups. Let M be a reductive monoid with unit group G, Borel subgroup B and Weyl group W . We study the partially ordered set of B×Borbits (with respect to Zariski closure inclusion) within a G × G-orbit of M . This is the same as studying a W ×W -or...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملGeneralised Ramsey numbers and Bruhat order on involutions
This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. We determine, in particular, all generalised Ramsey numbe...
متن کامل